|
The event calculus is a logical language for representing and reasoning about events and their effects first presented by Robert Kowalski and Marek Sergot in 1986. It was extended by Murray Shanahan and Rob Miller in the 1990s. Similar to other languages for reasoning about change, the event calculus represents the effects of actions on fluents. However, events can also be external to the system. In the event calculus, one can specify the value of fluents at some given time points, the events that take place at given time points, and their effects. ==Fluents and events== In the event calculus, fluents are reified. This means that they are not formalized by means of predicates but by means of functions. A separate predicate is used to tell which fluents hold at a given time point. For example, means that the box is on the table at time ; in this formula, is a predicate while is a function. Events are also represented as terms. The effects of events are given using the predicates and . In particular, means that, if the event represented by the term is executed at time , then the fluent will be true after . The predicate has a similar meaning, with the only difference being that will be false and not true after . 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「event calculus」の詳細全文を読む スポンサード リンク
|